kw.\*:("Context free grammar")
Results 1 to 25 of 1021
Selection :
On the equality of grammatical familiesGINSBURG, S; GOLDSTINE, J; SPANIER, E. H et al.Journal of computer and system sciences (Print). 1983, Vol 26, Num 2, pp 171-196, issn 0022-0000Article
Two ways of introducing alternation into context-free grammars and pushdown automataMORIYA, Etsuro; OTTO, Friedrich.IEICE transactions on information and systems. 2007, Vol 90, Num 6, pp 889-894, issn 0916-8532, 6 p.Article
A structural framework for assembly modeling and recognitionBAUCKHAGE, Christian; KUMMERT, Franz; SAGERER, Gerhard et al.Lecture notes in computer science. 2003, pp 49-56, issn 0302-9743, isbn 3-540-40730-8, 8 p.Conference Paper
Six nonterminals are enough for generating each R.E. language by a matrix grammarPAUN, G.International journal of computer mathematics. 1984, Vol 15, Num 1, pp 23-37, issn 0020-7160Article
On the size of unanbiguous context-free grammarsWYROSTEK, P.Theoretical computer science. 1986, Vol 47, Num 1, pp 107-110, issn 0304-3975Article
Further study of a stack-length modelGOODWIN, D. T.Computer journal (Print). 1985, Vol 28, Num 1, pp 9-16, issn 0010-4620Article
A note on depth-first derivationsMAKINEN, E.BIT (Nordisk Tidskrift for Informationsbehandling). 1985, Vol 25, Num 1, pp 293-296, issn 0006-3835Article
On derivation preservationMAKINEN, E.Information processing letters. 1984, Vol 19, Num 5, pp 225-228, issn 0020-0190Article
Grammaires algébriques et monoïdes simplifiables = Algebraic grammars and monoïd wich we can simplifyFROUGNY, C.R.A.I.R.O. Informatique théorique. 1984, Vol 18, Num 3, pp 225-239, issn 0399-0540Article
A note on pure grammarsMAGINEN, E.Information processing letters. 1986, Vol 23, Num 5, pp 271-274, issn 0020-0190Article
On ambiguity in dos systemsEHRENFEUCHT, A; HAUSSLER, D; ROZENBERG, G et al.R.A.I.R.O. Informatique théorique. 1984, Vol 18, Num 3, pp 279-295, issn 0399-0540Article
A characterization of exponential-time languages by alternating context-free grammarsIBARRA, O. H; TAO JIANG; HUI WANG et al.Theoretical computer science. 1992, Vol 99, Num 2, pp 301-313, issn 0304-3975Article
An undecidable problem for context-free grammarsMAKINEN, E.Information processing letters. 1985, Vol 20, Num 3, pp 141-142, issn 0020-0190Article
On Greibach normal form constructionURBANEK, F. J.Theoretical computer science. 1985, Vol 40, Num 2-3, pp 315-317, issn 0304-3975Article
Computational representations of Herbrand models using grammarsMATZINGER, R.Lecture notes in computer science. 1997, pp 334-348, issn 0302-9743, isbn 3-540-63172-0Conference Paper
A parsing method for context-free languages using bottom-up lookahead computationWATANABE, Y; TOKUDA, T.Systems and computers in Japan. 1996, Vol 27, Num 10, pp 14-22, issn 0882-1666Article
Node-label controlled graph grammars with context conditionsVON SOLMS, S. H.International journal of computer mathematics. 1984, Vol 15, Num 1, pp 39-49, issn 0020-7160Article
Direction independent context-sensitive grammarsKLEIJN, H. C. M; PENTONNEN, M; ROZENBERG, G et al.Information and control. 1984, Vol 63, Num 1-2, pp 113-117, issn 0019-9958Article
An easy proof of Greibach normal formEHRENFEUCHT, A; ROZENBERG, G.Information and control. 1984, Vol 63, Num 3, pp 190-199, issn 0019-9958Article
LR parsing for affix grammarsPOHLMANN, W.Acta informatica. 1983, Vol 20, Num 4, pp 283-300, issn 0001-5903Article
Two-level grammar as a functional programming languageEDUPUGANTY, B; BRYANT, B. R.Computer journal (Print). 1989, Vol 32, Num 1, pp 36-44, issn 0010-4620Article
On erasing in EOL formsROZENBERG, G; VERRAEDT, R.Discrete applied mathematics. 1985, Vol 12, Num 2, pp 175-189, issn 0166-218XArticle
On context-free and Szilard languagesMAKINEN, E.BIT (Nordisk Tidskrift for Informationsbehandling). 1984, Vol 24, Num 2, pp 164-170, issn 0006-3835Article
Self-embbeding indexed grammarsPARCHMANN, R; DUSKE, J.Theoretical computer science. 1986, Vol 47, Num 2, pp 219-223, issn 0304-3975Article
